Location:
Search - maze problem
Search list
Description: 迷宫问题，可视化，包括迷宫的生成，然后程序自动的找出迷宫的路径-Maze problem, visualization, including the generation of the maze, and then the program automatically find the path of the maze
Platform: |
Size: 2311168 |
Author: 文波 |
Hits:
Description: 应用程序向导已为您创建了此 迷宫问题 应用程序。
本文件概要介绍组成 迷宫问题 应用程序的每个文件的内容。
迷宫问题.vcxproj
这是使用应用程序向导生成的 VC++ 项目的主项目文件，
其中包含生成该文件的 Visual C++
的版本信息，以及有关使用应用程序向导选择的平台、配置和项目功能的信息。
迷宫问题.vcxproj.filters
这是使用“应用程序向导”生成的 VC++ 项目筛选器文件。
它包含有关项目文件与筛选器之间的关联信息。 在 IDE
中，通过这种关联，在特定节点下以分组形式显示具有相似扩展名的文件。
例如，“.cpp”文件与“源文件”筛选器关联。
迷宫问题.cpp
这是主应用程序源文件。-Application Wizard has been created for you, the this maze problem application. Summary of this document introduces the contents of each file up the application of the maze problem. Maze problem. Vcxproj Application Wizard generates the main project VC++ file, which contains Visual C++ generate the file version information, as well as the information about using the application wizard to select the platform, configuration and project features. The filter file maze problem. Vcxproj.filters This is to use the Application Wizard generates VC++ project. It contains related information between the relevant project documents, and filters. In the IDE, through this association, in particular node groups display files with similar extensions. For example. " Cpp file with source files" filter associated. The maze. Cpp This is a main application source file.
Platform: |
Size: 2167808 |
Author: 刘兵 |
Hits:
Description: 用C语言，通过典型的线性数据结构栈来解决迷宫问题，算法与严蔚敏的数据结构中相同-C language, typical stack linear data structure to solve the maze problem, the same algorithm and data structure Yan Wei Min
Platform: |
Size: 760832 |
Author: 萧一 |
Hits:
Description: 分治算法，走迷宫问题，0可通过，1不可通过。-Divide and conquer algorithms, Maze problem by, not by.
Platform: |
Size: 1024 |
Author: 林洁 |
Hits:
Description: 这是我的数据结构课程第三次作业--迷宫问题求解，包含递归与非递归算法-This is the third of my data structure course work- the maze problem-solving, including recursive and non-recursive algorithm
Platform: |
Size: 188416 |
Author: tgl |
Hits:
Description: 迷宫游戏的C/C++代码，提供给C/C++编程爱好者-Maze game C/C++ code to C/C++ programming enthusiasts
Platform: |
Size: 198656 |
Author: hongcongshu |
Hits:
Description: 利用C语言编程，分别采用递归和非递归的方法解决迷宫问题-Using the C programming language, namely the use of recursive and non-recursive methods to solve the maze problem
Platform: |
Size: 103424 |
Author: eliizabeth |
Hits:
Description: maze solution. it is a solution for maze problem with matlab code. in this solution I used very simple functions and it is easy for everyone.
Platform: |
Size: 1024 |
Author: lily |
Hits:
Description: 经典的c语言迷宫问题解答，寻找路径，对于新手理解栈有很大帮助-maze problem
Platform: |
Size: 1024 |
Author: 于海坤 |
Hits:
Description: 针对迷宫问题的解决思路及其相应的C++解决代码-Corresponding C++ to solve the maze code
Platform: |
Size: 1024 |
Author: 李一野 |
Hits:
Description: 数据结构编写迷宫问题，利用入栈，出栈，队等知识，编写调试运行-Data structure of the maze problem, the use of the stack, the stack, teams knowledge, the preparation of commissioning
Platform: |
Size: 1416192 |
Author: 沈颜 |
Hits:
Description: 罗密欧与朱丽叶的迷宫问题。罗密欧与朱丽叶身处一个m×n的迷宫中，如图所示。每一个方格表示迷宫中的一个房间。这m×n个房间中有一些房间是封闭的，不允许任何人进入。在迷宫中任何位置均可沿8 个方向进入未封闭的房间。罗密欧位于迷宫的(p，q)方格中，他必须找出一条通向朱丽叶所在的(r，s)方格的路。在抵达朱丽叶之前，他必须走遍所有未封闭的房间各一次，而且要使到达朱丽叶的转弯次数为最少。每改变一次前进方向算作转弯一次。请设计和实现一个算法帮助罗密欧找出这样一条道路。-Romeo and Juliet maze. Romeo and Juliet live in a maze mn, as shown. Each box represents a maze of rooms. This mn rooms in some of the rooms are closed, do not allow anyone to enter. Not enter a closed room at any location along the maze of eight directions. Romeo is located in the maze (p, q) grid, he must find a path to Juliet where (r, s) grid road. Before arriving Juliet, he must not traveled all closed room each time, and Juliet' s turn to make to reach the number of the least. Every change in the direction counted once turning once. Please help design and implement an algorithm Romeo find such a path.
Platform: |
Size: 14434304 |
Author: zhangqian |
Hits:
Description: 数据结构课程设计——迷宫问题求解代码（已测试，可直接运行）-Curriculum design- maze problem solving code (already tested, can be directly run)
Platform: |
Size: 1024 |
Author: Jason |
Hits:
Description: 本代码主要是实现了迷宫中如何探索路径的问题，其中主要运用了栈的知识。-The code is mainly realized how to explore the path of maze problem, which mainly uses the knowledge of the stack.
Platform: |
Size: 3072 |
Author: 陈默 |
Hits:
Description: 迷宫问题的求解过程可以采用回溯法即在一定的约束条件下试探地搜索前进，若前进中受阻，则及时回头纠正错误另择通路继续搜索的方法。从入口出发，按某一方向向前探索，若能走通，即某处可达，则到达新点，否则探索下一个方向；若所有的方向均没有通路，则沿原路返回前一点，换下一个方向再继续试探，直到所有可能的道路都探索到，或找到一条通路，或无路可走又返回入口点。在求解过程中，为了保证在达到某一个点后不能向前继续行走时，能正确返回前一个以便从下一个方向向前试探，则需要在试探过程中保存所能够达到的每个点的下标以及该点前进的方向，当找到出口时试探过程就结束了-Maze problem solving process can be used backtracking that under certain constraints exploratory search forward, if the advance is blocked, then go back in time to correct the errors continue to choose another path searching method. Starting the entrance, according to a forward direction to explore, if go through, that somewhere up, the new point is reached, otherwise explore the next direction if all directions are no paths, then a little before returning along the same route, replaced in one direction and then continue to test until all possible roads to explore, or find a path, or no way out but to return the entry point. Under the former in the solution process, when you can not move forward in order to ensure continued walking after reaching a certain point, in order to be able to return to the correct one the next tentative forward direction, you need to save in the test process of each point can be achieved scale and direction of the point forward, when the temptation to find
Platform: |
Size: 1024 |
Author: 林斌 |
Hits:
Description: 课堂作业 迷宫求解问题 c语言
main文件直接用-
Classwork maze problem solving c language
main files directly with
Platform: |
Size: 4096 |
Author: |
Hits:
Description: 简单的迷宫实现小程序 数据结构（C语言）作业-the code of the maze problem
Platform: |
Size: 3072 |
Author: 佳佳 |
Hits:
Description: 在迷宫问题中，我们需要解决的第一个问题，也是老师布置给我们的作业就是从我们是否能从迷宫的起点到终点找到一条不间断的通路。这时我们的基本想法就是定义一个数组maze[1000][1000]，将无法走到的地方即墙标记为0，能走到的地方标记为1。这时我们规定一个走的顺序，先向右走，如果向右走不通就向上走，都不行就向左，最后选择向下，如果到了一个格子，这个格子四个方向均走不通，则宣告这条路失败。(In the maze problem, the first problem we need to solve is the assignment given to us by the teacher, which is whether we can find an uninterrupted passage from the beginning to the end of the maze. Then our basic idea is to define an array maze[1000][1000] that will not be able to go where the wall is marked 0 and can go where it is marked as 1. Then we set a go order, first go to the right, if not to walk on the right, not left, finally down, if to a grid, the grid in four directions was dead, that is the way of failure.)
Platform: |
Size: 32768 |
Author: Ryan Lam
|
Hits:
Description: Maze algorithm source code using right-hand-on-wall
Platform: |
Size: 687104 |
Author: Minji
|
Hits:
Description: use q-learning to solve maze problem
Platform: |
Size: 11183 |
Author: 1377243675@qq.com |
Hits:
«
1
2
3
45
6
7
8
9
10
...
18
»